Simultaneous Graph Embedding with Bends and Circular Arcs
نویسندگان
چکیده
We consider the problem of simultaneous embedding of planar graphs. We demonstrate how to simultaneously embed a path and an n-level planar graph and how to use radial embeddings for curvilinear simultaneous embeddings of a path and an outerplanar graph. We also show how to use star-shaped levels to find 2-bends per path edge simultaneous embeddings of a path and an outerplanar graph. All embedding algorithms run in O(n) time.
منابع مشابه
Trees on Tracks
Simultaneous embedding of planar graphs is related to the problems of graph thickness and geometric thickness. Techniques for simultaneous embedding of cycles have been used to show that the degree-4 graphs have geometric thickness at most two [3]. Simultaneous embedding techniques are also useful in visualization of graphs that evolve through time. The notion of simultaneous embedding is relat...
متن کاملOn the bend number of circular-arc graphs as edge intersection graphs of paths on a grid
Golumbic, Lipshteyn and Stern proved that every graph can be represented as the edge intersection graph of paths on a grid, i.e., one can associate to each vertex of E-mail addresses: [email protected]; [email protected]; [email protected]; [email protected]; [email protected]; [email protected]; [email protected]. This work was partially supported by MathAmSud...
متن کاملOuterplanar Graphs and Trees on Tracks
Given a vertex-labeled tree on n vertices we show how to obtain a straight-line, crossings-free drawing of it on a set of n labeled concentric tracks, such that the vertex labels match the track labels. The tracks can be defined by conic sections (such as circles, ellipses, circular arcs) or other smooth convex curves. We show that this type of embedding can be used to simultaneously embed tree...
متن کاملSimultaneous Embedding of Planar Graphs with Few Bends
We consider several variations of the simultaneous embedding problem for planar graphs. We begin with a simple proof that not all pairs of planar graphs have simultaneous geometric embedding. However, using bends, pairs of planar graphs can be simultaneously embedded on the O(n) × O(n) grid, with at most three bends per edge, where n is the number of vertices. The O(n) time algorithm guarantees...
متن کاملSimultaneously Embedding Planar Graphs at Fixed Vertex Locations
We discuss the problem of embedding planar graphs onto the plane with pre-specified vertex locations. In particular, we introduce a method for constructing such an embedding for both the case where the mapping from the vertices onto the vertex locations is fixed and the case where this mapping can be chosen. Moreover, the technique we present is sufficiently abstract to generalize to a method f...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Comput. Geom.
دوره 42 شماره
صفحات -
تاریخ انتشار 2006